On the block norm-P property

On p-norm linear discrimination

We consider a p-norm linear discrimination model that generalizes the model of Bennett and Mangasarian (1992) and reduces to a linear programming problem with p-order cone constraints. The proposed approach for handling linear programming problems with p-order cone constraints is based on reformulation of p-order cone optimization problems as second order cone programming (SOCP) problems when p...

The ¿-norm Extension Property for Banach Spaces1

On the strong p-Helly property

The notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, J. Combin. Theory Ser. B 38 (1985) 8–22]. Independently, other authors [A. Bretto, S. Ubéda, J. Žerovnik, A polynomial algorithm for the strong Helly property. Inform. Process. Lett. 81 (2002) 55–57, E. Prisner, Hereditary clique-...

On Property (A) and the socle of the $f$-ring $Frm(mathcal{P}(mathbb R), L)$

For a frame $L$, consider the $f$-ring $ mathcal{F}_{mathcal P}L=Frm(mathcal{P}(mathbb R), L)$. In this paper, first we show that each minimal ideal of $ mathcal{F}_{mathcal P}L$ is a principal ideal generated by $f_a$, where $a$ is an atom of $L$. Then we show that if $L$ is an $mathcal{F}_{mathcal P}$-completely regular frame, then the socle of $ mathcal{F}_{mathcal P}L$ consists of those $f$...

Estimating the matrix p-norm

The H61der p-norm of an m • n matrix has no explicit representation unless p = 1, 2 or ~ . It is shown here that the p-norm can be estimated reliably in O(mn) operations. A generalization of the power method is used, with a starting vector determined by a technique with a condition est imation flavour. The algor i thm nearly always computes a p-norm estimate correct to the specified accuracy, a...